(a, B)-rectangle Patterns in Permutations and Words

In this paper, we introduce the notion of an (a, b)-rectangle pattern on permutations which is closely related to the notion of successive elements (bonds) in permutations and to mesh patterns introduced recently by Brändén and Claesson. We call the (k, k)-rectangle pattern the k-box pattern. We show that we can derive an explicit formula for the number of permutations of Sn which have the maximum possible occurrences of the 1-box pattern by using a new enumerative result on pattern-avoidance in signed permutations. We also study the notion of (a, b)-rectangle patterns in words. In particular, we give a general method for computing the generating function for the distribution of (1, b)-rectangle patterns on words over an alphabet of size k for b ∈ {1, 2}. Our method requires to invert a certain matrix depending on b and k, and can be used to give explicit formuals for such generating functions for k = 2, . . . , 7. We also provide similar results for the distribution of bonds over words. As a corollary to our studies, we prove a conjecture of Mathar on the number of “stable LEGO walls” of width 7, as well as prove three conjectures due to Hardin and a conjecture due to Barker. We provide generating functions for two sequences published by Hardin in the On-Line Encyclopedia of Integer Sequences.